On M/G/1 queues with the first N customers of each busy period receiving exceptional services

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the exact asymptotics of the busy period in GI/G/1 queues

In this paper we study the busy period in GI/G/1 work-conserving queues. We give the exact asymptotics of the tail distribution of the busy period under the light-tailed assumptions. We also study the workload process in the M/G/1 system conditioned to stay positive.

متن کامل

Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility

We consider two models of M=G=1 and G=M=1 type queueing systems with restricted accessibility. Let (V (t))t¿0 be the virtual waiting time process, let Sn be the time required for a full service of the nth customer and let n be his arrival time. In both models there is a capacity bound v∗ ∈ (0;∞): In Model I the amount of service given to the nth customer is equal to min[Sn; v∗ − V ( n−)], i.e. ...

متن کامل

Busy period analysis for M / PH /1 queues with workload dependent balking

We consider an M/PH/1 queue with workload-dependent balking. An arriving customer joins the queue and stays until served if and only if the system workload is no more than a fixed level at the time of his arrival. We begin by considering a fluid model where the buffer content changes at a rate determined by an external stochastic process with finite state space. We derive systems of first-order...

متن کامل

Queues with slow servers and impatient customers

Article history: Received 6 August 2008 Accepted 18 February 2009 Available online 27 February 2009

متن کامل

Queues with Many Servers and Impatient Customers

The asymptotic many-server queue with abandonments, G/GI/N +GI , is considered in the qualityand efficiency-driven (QED) regime. Here the number of servers and the offered load are related via the square-root rule, as the number of servers increases indefinitely. QED performance entails short waiting times and scarce abandonments (high quality) jointly with high servers’ utilization (high effic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 1999

ISSN: 0453-4514

DOI: 10.1016/s0453-4514(00)87115-x